منابع مشابه
An Optimal Algorithm for Prufer Codes
This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obta...
متن کاملAn Optimal Two-Stage Decoding Algorithm for Linear Block Codes
A new optimal two stages decoding algorithm for linear block codes is presented. At first stage, the minimum sufficient test set Ŝ is estimated. With the minimum sufficient test set, decoding complexity can be greatly reduced while maintaining the optimal performance. At the second stage, ordered processing is performed over the estimated minimum sufficient test set Ŝ to find the optimal soluti...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملan optimal similarity measure for collaborative filtering using firefly algorithm
recommender systems (rs) provide personalized recommendation according to user need by analyzing behavior of users and gathering their information. one of the algorithms used in recommender systems is user-based collaborative filtering (cf) method. the idea is that if users have similar preferences in the past, they will probably have similar preferences in the future. the important part of col...
متن کاملLow Complexity Algorithm for Optimal Hard Decoding of Convolutional Codes
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2009
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2009.22016